Well-behaved and totally bounded approximate identities forC0(X)

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Well-behaved principles alternative to bounded induction

We introduce some Π1–expressible combinatorial principles which may be treated as axioms for some bounded arithmetic theories. The principles, denoted Sk(Σn, length log k) and Sk(Σn, depth log k) (where ‘Sk’ stands for ‘Skolem’), are related to the consistency of Σn–induction: for instance, they provide models for Σn–induction. However, the consistency is expressed indirectly, via the existence...

متن کامل

On bounded weak approximate identities and a new version of them

In this paper, we give a short survey of results and problems concerning the notion of bounded weak approximate identities in Banach algebras. Also, we introduce a new version of approximate identities and give one illuminating example to show the difference.

متن کامل

Bounded Approximate Identities in Ternary Banach Algebras

and Applied Analysis 3 Step 1. Let F {a} be singleton. Then, there are u ∈ U and v ∈ V such that ‖uv‖ < M, and ‖ u, v, a − a‖ < M 1 . 2.2 Letting w uv ◦ uv, then ‖ uv ◦ uv, a − a‖ ‖ u, v, u, v, a − a − u, v, a − a ‖ < . 2.3 Step 2. Let F {a1, a2}. There is a u1, v1 ∈ U × V such that ‖ u1, v1, a1 − a1‖ < / 1 M , and for u1, v1, a2 − a2 ∈ A there is a u2, v2 ∈ U × V such that ‖ u2, v2, u1, v1, a2...

متن کامل

FUZZY BOUNDED SETS AND TOTALLY FUZZY BOUNDED SETS IN I-TOPOLOGICAL VECTOR SPACES

In this paper, a new definition of fuzzy bounded sets and totallyfuzzy bounded sets is introduced and properties of such sets are studied. Thena relation between totally fuzzy bounded sets and N-compactness is discussed.Finally, a geometric characterization for fuzzy totally bounded sets in I- topologicalvector spaces is derived.

متن کامل

Well Behaved Transition Systems

The well-quasi-ordering (i.e., a well-founded quasi-ordering such that all antichains are finite) that defines well-structured transition systems (WSTS) is shown not to be the weakest hypothesis that implies decidability of the coverability problem. We show coverability decidable for monotone transition systems that only require the absence of infinite antichains and call well behaved transitio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Pacific Journal of Mathematics

سال: 1976

ISSN: 0030-8730,0030-8730

DOI: 10.2140/pjm.1976.65.261